Open questions related to the problem of Birkhoff and Maltsev
نویسندگان
چکیده
The Birkhoff-Maltsev problem asks for a characterization of those lattices each of which is isomorphic to the lattice L(K) of all subquasivarieties for some quasiva-riety K of algebraic systems. The current status of this problem, which is still open, is discussed. Various unsolved questions that are related to the Birkhoff-Maltsev problem are also considered, including ones that stem from the theory of propositional logics. Having whetted the reader's appetite in the preface to this special issue by claiming that much remains to be done in the theory of quasivarieties, we feel some responsibility to justify our claim. To do so, we will discuss the current status of the Birkhoff-Maltsev problem and consider open questions related to it. An algebraic system is a nonvoid set which admits a family of operations and relations. It is an algebra if it admits no relations and a relational system if it admits no operations. For a class K of algebraic systems of the same signature, let I(K), H(K), S(K), P(K), and P u (K) respectively denote the classes of all isomorphic algebraic systems, homomorphic images, subsystems, direct products, and ultraproducts of algebraic systems in K (note that the direct product of an empty set of algebraic systems, the trivial algebraic system, is included in P(K)). A class K is a quasivariety provided K = ISPP u (K) (equivalently, K is a universal Horn class that contains a trivial algebraic system) and is a variety provided K = HSP(K) (thus, every variety is a quasivariety). It was shown by Maltsev [82] (see also Grätzer and Lakser [45]), that a class K of algebraic systems is a quasivariety if and only if it is the class of Special issue of Studia Logica: " Algebraic Theory of Quasivarieties " Presented by Ryszard Wójcicki;
منابع مشابه
A Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE)
This paper proposes a novel, bi-objective mixed-integer mathematical programming for an open shop scheduling problem (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a fuzzy multi-objective decision making (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملA Qualitative Investigation Into Conceptual Understanding at Iranian Elementary Schools
This study attempts to root out some of the causes of absence of conceptual understanding in elementary level particularly in math subject and the factors that cause this deficiency. As a body of researchers, we use a quasi-form of methodology qualitatively designed by which we give a pre-test and post-test to our participants (randomly selected teachers and students), through some open-ended q...
متن کاملOn second derivative 3-stage Hermite--Birkhoff--Obrechkoff methods for stiff ODEs: A-stable up to order 10 with variable stepsize
Variable-step (VS) second derivative $k$-step $3$-stage Hermite--Birkhoff--Obrechkoff (HBO) methods of order $p=(k+3)$, denoted by HBO$(p)$ are constructed as a combination of linear $k$-step methods of order $(p-2)$ and a second derivative two-step diagonally implicit $3$-stage Hermite--Birkhoff method of order 5 (DIHB5) for solving stiff ordinary differential equations. The main reason for co...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 78 شماره
صفحات -
تاریخ انتشار 2004